Automated Strategies for Spe ializingConstraint Logi

Rules and Strategies for Contextual Spe ializationof Constraint Logi Programs

Ö Blockinøø Blockinøùööð Ëô Blockin Blockin¬ Blockin Blockinøøóò¸üôðóööøøóò Òò Ëëñùððøøóò Ììöóùùù Êêûööøøòò¹äóóó

In re ent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the spe i ation of pro essor ar hite tures. In their approa h pro essors spe i ed by term rewriting systems are translated into a standard hardware des ription language for simulation purposes. In this work we present our urrent investigation on the use of Rewriting-Logi , whi h is a more powerful theore...

Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin

The simulation of pro essors over simple ar hite tures is important for enabling test and veri ation prior to the expensive implementation involved in the development of new hardware te hnologies. Arvind's group has illustrated how to des ribe pro essors by term rewriting systems and has introdu ed a te hnique for proving the orre tness of spe i ations for elaborated pro essors with respe t to ...

Spe ialization with Clause Splitting for DerivingDeterministi Constraint Logi

Modular Formal Spe i ation of Data and Behaviour

Abstra t. We propose a modular approa h to the formal spe i ation of the requirements on embedded systems. In this approa h, requirements on data are spe i ed as invariants on states. Requirements on behaviour are spe i ed assertionally by temporal logi formulae, restri ting the runs of the system. The proposed method is modular, be ause omponents an be spe i ed and analysed in isolation, and t...